Partial Evaluation of the Euclidian Algorithm ( Extended
نویسنده
چکیده
Some programs are easily amenable to partial evaluation because their control flow clearly depends on one of their parameters. Specializing such programs with respect to this parameter eliminates the associated interpretive overhead. Some other programs, however, do not exhibit this interpreter-like behavior. Each of them presents a challenge for partial evaluation. The Euclidian algorithm is one of them, and in this article, we make it amenable to partial evaluation. We observe that the number of iterations in the Euclidian algorithm is bounded by a number that can be computed given either of the two arguments. We thus rephrase this algorithm using bounded recursion. The resulting program is better suited for automatic unfolding and thus for partial evaluation. Its specialization is efficient.
منابع مشابه
DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملPrediction of IC50 of 2,5-diaminobenzophenone organic derivatives using informatics-aided genetic algorithm
In the present paper, informatics-aided quantitative structure activity relationship (QSAR) models using genetic algorithm-partial least square (GA-PLS), genetic algorithm-Kernel partial least square (KPLS), and Levenberg-Marquardt artificial neural network (LM ANN) approach were constructed to access the antimalarial activity (pIC50) of 2,5-diaminobenzophenone derivatives. Comparison of errors...
متن کامل